Theorem proving by chain resolution

Resolution Theorem Proving

Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered f...

Non-Resolution Theorem Proving

This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Exampl...

Resolution-Based Theorem Proving for Manyvalued Logics

A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...

Inference-Security Analysis Using Resolution Theorem-Proving

Indirect logical inferences can provide a significant security threat to information processing systems, but they have not been much studied. Classification of data can reduce the threat, but classification decisions are typically left to the intuitive judgment of experts. Progress has been made on analyzing indirect statistical inferences that may compromise security of a database system ([3],...

Limited resource strategy in resolution theorem proving